Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
نویسندگان
چکیده
The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.
منابع مشابه
Optimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کاملA new approach for data visualization problem
Data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. In this paper, we formulated d...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملApplication of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic techniqu...
متن کاملAn Artificial Bee Colony Algorithm for the Set Covering Problem
In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the...
متن کامل